Neural network-based hybrid models developed for free radical polymerization of styrene

In the present work, the free radical polymerization of styrene is modeled by considering the phenomenology of the process (a simplified model, which does not include the diffusional effects, gel, and glass effects) in combination with an empirical model represented by an artificial neural network. Differential evolution (DE) algorithm, belonging to the class of evolutionary algorithms, is applied for developing the neural models in optimal forms. For improving the results—predicted conversion and molecular weights as function of time, temperature, and initiator concentration—different combinations between phenomenological model and neural network are tested; also, individual and stacked neural networks have been developed for the polymerization process. This methodology based on hybrid models, including neural networks aggregated in stacks, provides accurate results.     

基于Matlab的量子激光雷达稳频通信模拟系统设计

传统通信模拟系统设计较为复杂,导致模拟过程消耗能量较大,不能准确模拟稳频通信质量。因此,提出基于Matlab的量子激光雷达稳频通信模拟系统。由于振荡器是雷达形成初始信号源的基础,通过分析振荡电路与相位噪声,获得相位噪声函数与通信频率存在的关系;为确保通信过程的稳定,将准确性与稳定性作为信号质量的评价指标,并采用锁频环稳频技术计算频率偏移程度,根据PID控制算法控制频率,量子激光雷达稳频通信;利用Matlab确定激光器、探测器等硬件组成结构,通过时序与数字阵列的设置完成模拟系统设计。仿真结果表明所提系统结构简便、性能稳定,能够真实模拟出稳频通信的信号质量。     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

认同度修正下的近相邻改进推荐算法研究

如何融合多方因素准确地为用户提供个性化产品一直是关注的热点问题，由此，一个新的近相邻改进算法融入了大众化认同度和个性化认同度，利于更加高效地挖掘隐藏信息。实验结果表明，相对于传统近相邻算法，认同度修正算法虽然查全率小幅度上下波动，但其他多个评价指标都得到极大提升，假正率和深度有所减少，查准率、[F1]值和提升度得以增加，并且，受试者特征曲线和提升曲线也都说明此修正算法具有更为显著的推荐效果。     

基于K-AP算法的高光谱图像波段选择方法

在高光谱图像分析领域中，波段选择是一种能有效减少高光谱图像维度的方法。K类仿射传播算法是一种高效的聚类算法，已成功地应用于人脸识别和数据分析等领域，但在高光谱图像分析领域还少有成功的应用。提出将K-AP算法应用于高光谱图像波段选择，对高光谱图像进行有效的数据压缩。针对K-AP算法的特点，基于Kullback-Leibler散度定义了新的相似度矩阵，对波段进行度量，再使用K-AP算法进行聚类，选择最有代表性的波段。实验结果表明，与常用的波段选择方法相比，所提出的方法有更好的表现。     

基于多边限定的室内定位方法设计与系统实现

随着基于位置服务（Location Based Services，LBS）的发展与智能移动设备的普及，室内定位算法与系统受到了广泛研究与关注。为提高室内定位精度、增强系统鲁棒性，提出了基于多边限定的fingerprint定位方法。基于Wi-Fi RSSI（Received Signal Strength Indication）信号处理建立离线fingerprint数据库；通过对拟合距离-RSSI函数分析，提出了多边限定的方法确定一个最佳参考点（Reference Point，RP）集合，缩小在线定位阶段的搜索范围。在此基础上，再利用fingerprint定位方法进行定位。此外，实现了基于提出方法的室内定位系统原型用于算法性能评估。通过大量真实场景实验分析、验证了相较于传统fingerprint方法，基于多边限定的fingerprint定位方法能有效提高室内定位精度，增强系统鲁棒性。     

基于多基表示的滑动窗口椭圆曲线多标量乘算法

标量乘运算从整体上决定了椭圆曲线密码体制的快速实现效率，在一些椭圆曲线公钥密码体制中需要计算多标量乘。多基数链的标量表示长度更短、非零比特数目更少，较好地适用于椭圆曲线标量乘的快速计算。为了提高椭圆曲线密码的效率，在已有的二进制域和素域的标量乘算法的基础上，结合滑动窗口技术、多基算法，提出新的更高效的多标量乘算法。实验结果表明，新算法与传统Shamir算法和交错NAF算法相比，其所需的运算量更少，能有效地提高椭圆曲线多标量乘算法的效率，使多标量乘的运算更高效。相比于其他算法，新算法的计算效率比已有的多标量乘算法提高了约7.9%~20.6%。     

An adjusted K‐medoids clustering algorithm for effective stability in vehicular ad hoc networks

Recently, the routing problem in vehicular ad hoc networks is one of the most vital research. Despite the variety of the proposed approaches and the development of communications technologies, the routing problem in VANET suffers from the high speed of vehicles and the repetitive failures in communications. In this paper, we adjusted the well‐known K‐medoids clustering algorithm to improve the network stability and to increase the lifetime of all established links. First, the number of clusters and the initial cluster heads will not be selected randomly as usual, but based on mathematical formula considering the environment size and the available transmission ranges. Then the assignment of nodes to clusters in both k‐medoids phases will be carried out according to several metrics including direction, relative speed, and proximity. To the best of our knowledge, our proposed model is the first that introduces the new metric named “node disconnection frequency.” This metric prevents nodes with volatile and suspicious behavior to be elected as a new CH. This screening ensures that the new CH retains its property as long as possible and thus increases the network stability. Empirical results confirm that in addition to the convergence speed that characterizes our adjusted K‐medoids clustering algorithm (AKCA), the proposed model achieves more stability and robustness when compared with most recent approaches designed for the same objective.     

基于孪生支持向量回归机的转炉炼钢终点预测

为了提高转炉炼钢的终点命中率，建立了一种新的转炉终点预测模型，实现了对转炉终点碳质量分数和温度的准确预测。模型采用K最近邻孪生支持向量机(KNNWTSVR)算法，将权重矩阵引入到目标函数中，并利用鲸群优化算法进行求解，提高了传统算法的性能；然后基于某炼钢厂260 t转炉的实际生产数据，建立了转炉炼钢终点预测模型。结果表明，预测模型的终点碳质量分数(误差±0.005%)和温度(误差±15 ℃)的终点单命中率分别为94%和88%，双命中率达到84%。与其他两种现有的建模方法相比，本模型取得了最优的预测效果。该方法满足转炉炼钢实际生产的需求，也可适用于钢铁冶金其他领域的数学建模。